Fast Regular Circuits for Network-based Parallel Data Processing
نویسندگان
چکیده
منابع مشابه
Fast Bit-Parallel Matching for Network and Regular Expressions
In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expressions without Kleene-closure and useful in applications such as bioinformatics and event stream processing. Following the study of Navarro (RECOMB, 2001) on the extended string matching, we introduce new operations called Scatter, ...
متن کاملA new fixed degree regular network for parallel processing
We propose a family of regular Cayley network graphs of degree three based on permutation groups for design of massively parallel systems. These graphs are shown to be based on the shuffle exchange operations, to have logarithmic diameter in the number of vertices, and to be maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and...
متن کاملParallel Processing Letters Fast Parallel Permutation Algorithms
We investigate the problem of permuting n data items on an EREW PRAM with p processors using little additional storage. We present a simple algorithm with run time O((n/p)logn) and an improved algorithm with run time O(n/p+logn loglog(n/p)). Both algorithms require n additional global bits and O(1) local storage per processor. If preex summation is supported at the instruction level, the run ti...
متن کاملparallel network processing
ly, we consider an in-memory interface to cleanly separate the networking from the disk activity. This is equivalent to assuming that the server’s networking activity can be explicitly scheduled, in a manner that is independent from other server activity. Our results will apply to systems in which this is the case. We anticipate that in large-scale servers, independent network scheduling will b...
متن کاملFast parallel circuits for the quantum Fourier transform
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of O(log n + log log(1/ε)) on the circuit depth for computing an approximation of the QFT with respect to the modulus 2n with error bounded by ε. Thus, even for exponentially small error, our circuits have depth O(log n). The best previous depth bound was O(n), even for approximations wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Electrical and Computer Engineering
سال: 2013
ISSN: 1582-7445,1844-7600
DOI: 10.4316/aece.2013.04008